/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
const ll maxn = 110000;
ll n;
ll c[maxn];
ll a[maxn];
ll b[maxn];
ll lowbit(ll x){
    return x & (-x);
}

void add(ll pos){
    while(pos<=n){
        c[pos] += 1;
        pos += lowbit(pos);
    }
    return ;
}

ll getsum(ll pos){
    ll sum = 0;
    while(pos>0){
        sum += c[pos];
        pos -= lowbit(pos);
    }
    return sum;
}

int main()
{
    IOS;
    cin >> n;
    for (ll i=1;i<=n;i++)
    {
        cin >> a[i];
    }
    for (ll i=1;i<=n;i++){
        add(a[i]);
        b[i] = i - getsum(a[i]);
    }
    // for (ll i=1;i<=n;i++){
    //     cout << b[i] << " ";
    // }
    // cout << endl;

    getchar();
    getchar();
    return 0;
}
